Extending the Tamari Lattice to Some Compositions of Species
نویسنده
چکیده
COMPOSITIONS OF SPECIES STEFAN FORCEY Abstract. An extension of the Tamari lattice to the multiplihedra is discussed, along with projections to the composihedra and the Boolean lattice. The multiplihedra and composihedra are sequences of polytopes that arose in algebraic topology and category theory. Here we describe them in terms of the composition of combinatorial species. We de ne lattice structures on their vertices, indexed by painted trees, which are extensions of the Tamari lattice and projections of the weak order on the permutations. The projections from the weak order to the Tamari lattice and the Boolean lattice are shown to be di erent from the classical ones. We review how lattice structures often interact with the Hopf algebra structures, following Aguiar and Sottile who discovered the applications of Mobius inversion on the Tamari lattice to the Loday-Ronco Hopf algebra.
منابع مشابه
Chains of Maximum Length in the Tamari Lattice
The Tamari lattice Tn was originally defined on bracketings of a set of n+1 objects, with a cover relation based on the associativity rule in one direction. Although in several related lattices, the number of maximal chains is known, quoting Knuth, “The enumeration of such paths in Tamari lattices remains mysterious.” The lengths of maximal chains vary over a great range. In this paper, we focu...
متن کاملIntervals of balanced binary trees in the Tamari lattice
We show that the set of balanced binary trees is closed by interval in the Tamari lattice. We establish that the intervals [T, T ′] where T and T ′ are balanced binary trees are isomorphic as posets to a hypercube. We introduce synchronous grammars that allow to generate tree-like structures and obtain fixed-point functional equations to enumerate these. We also introduce imbalance tree pattern...
متن کاملAn extension of Tamari lattices
For any finite path v on the square lattice consisting of north and east unit steps, we construct a poset Tam(v) that consists of all the paths lying weakly above v with the same endpoints as v. For particular choices of v, we recover the traditional Tamari lattice and the m-Tamari lattice. In particular this solves the problem of extending the m-Tamari lattice to any pair (a, b) of relatively ...
متن کاملOn a Subposet of the Tamari Lattice
We discuss some properties of a subposet of the Tamari lattice introduced by Pallo (1986), which we call the comb poset. We show that three binary functions that are not well-behaved in the Tamari lattice are remarkably well-behaved within an interval of the comb poset: rotation distance, meets and joins, and the common parse words function for a pair of trees. We relate this poset to a partial...
متن کاملMotzkin subposets and Motzkin geodesics in Tamari lattices
The Tamari lattice of order n can be defined by the set Dn of Dyck words endowed with the partial order relation induced by the well-known rotation transformation. In this paper, we study this rotation on the restricted set of Motzkin words. An upper semimodular join semilattice is obtained and a shortest path metric can be defined. We compute the corresponding distance between two Motzkin word...
متن کامل